A Hybrid Dynamic Programming for Solving Fixed Cost Transportation with Discounted Mechanism
نویسندگان
چکیده
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملConstrained Discounted Dynamic Programming
This paper deals with constrained optimization of Markov Decision Processes with a countable state space, compact action sets, continuous transition probabilities, and upper semi-continuous reward functions. The objective is to maximize the expected total discounted reward for one reward function, under several inequality constraints on similar criteria with other reward functions. Suppose a fe...
متن کاملA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملA hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem
0360-8352/$ see front matter 2012 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.cie.2012.12.001 q This manuscript was processed by Area Editor Iris F.A. Vis. ⇑ Corresponding author. Current address: Operations Research Dept., Institute of Statistical Studies and Research (ISSR), Cairo University, Egypt. Tel.: +2
متن کاملA hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem
This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge transportation problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining a genetic algorithm based on a hash table coding of the individuals with a powerful local search procedure. The prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization
سال: 2016
ISSN: 2356-752X,2314-6486
DOI: 10.1155/2016/8518921